TITLE : Probability - driven Routing in a Datapath Environment
نویسندگان
چکیده
For a four-layer datapath routing environment, we present an algorithm that considers all the nets simultaneously, thus avoiding the net-ordering problem. Our algorithm progresses in two phases. The first phase involves formulating the problem using a probabilistic model, whereby routing probabilities are calculated for potential routing regions; these probabilities are consolidated into a congestion metric for each region. The second phase employs an iterative diversion technique where the region with the maximum congestion metric is iteratively relaxed. The above process is repeated until the track probabilities crystallize into integer values of 1 and 0. We have run the algorithm on large test cases; and experimental results show that we can achieve significant routability within a few number of available tracks.
منابع مشابه
An efficient and regular routing methodology for datapath designsusing net regularity extraction
We present a new detailed routing methodology specifically designed for datapath layouts. In typical state-of-the-art microprocessor designs, datapaths comprise about 70% of the logic (excluding caches). However, most logic and layout synthesis research has targeted randomlogic portions of the design. In general, techniques for random-logic placement and routing do not produce good results for ...
متن کاملA Reconfigurable Data - Driven ALU for Xputers
A reconfigurable data-driven datapath architecture for ALUs is presented which may be used for custom computing machines (CCMs), Xputers (a class of CCMs) and other adaptable computer systems as well as for rapid prototyping of high speed datapaths. Fine grained paral-lelism is achieved by using simple reconfigurable processing elements which are called datapath units (DPUs). The word-oriented ...
متن کاملExploration of Area and Performance Optimized Datapath Design Using Realistic Cost Metrics
We present a novel technique for datapath allocation, which incorporates interconnection area and delay estimates based on dynamic oorplanning. In this approach, datapath area is minimized by minimizing the number of wires, routing tracks, and multiplexers, while performance is optimized by minimizing wire length. The simultaneous optimization of these physical cost metrics allows the system to...
متن کاملFPGA for High-Performance Bit-Serial Pipeline Datapath
| In this paper, we introduce our work on the chip design of a new FPGA chip for highperformance bit-serial pipeline datapath which is customized both in the logic architecture and routing architecture. The chip consists of 200k transistors on 3.5mm square substrate (excluding the IO pad area) using 0.5 2-metal process technology. The estimated clock frequency is 156MHz.
متن کامل